Classical Absolute/Differential Programs

Classical Proofs and Programs

Classical Negation in Logic Programs

The purpose of this work is to extend logic programming beyond normal programs, as defined in [Lloy87], and thus beyond(positive) definite clause programming, by allowing also definite negative heads. Thus we admit program clauses with both positive and (classically) negated atoms conjoined in the body, and at most one literal as its head (clauses with disjunctions of literals in the head are t...

Classical Simulation Complexity of Quantum Branching Programs

We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that computes the same function. Second technique is a classical stochastic simulation technique f...

Simplifying Programs Extracted from Classical Proofs

Curry-Howard isomorphism extended to classical logic by associating the rule of double-negation elimination with the control operator C allows to view a natural deduction derivation of a Π2 formula as a program. However, programs produced by this method are often hard to understand, in part because of the presence of control operators. In this paper, we show how to simplify such programs and ma...

Logic Programs and Classical Planning with LTLConstraints

The paper deals with encoding planning problems with LTL constraints as disjunctive logic programs (LP ) and computing the plans (answer sets) under the stable model semantics. In order to encode the problem as a logic program, we use a well known SAT encoding of classical planning problems. Observing that obtaining the LP encoding for the LTL constraints results in an exponential blowup in the...